منابع مشابه
Fluted Formulas and the Limits of Decidability
In the predicate calculus, variables provide a flexible indexing service that selects the actual arguments to a predicate letter from among possible arguments that precede the predicate letter (in the parse of the formula). In the process of selection, the possible arguments can be permuted, repeated (used more than once), and skipped. If this serviCe is withheld, so that arguments must be the ...
متن کاملDecidability of Context Logic
We consider the problem of decidability for Context Logic for sequences, ranked trees and unranked trees. We show how to translate quantifier-free formulae into finite automata that accept just the sequences or trees which satisfy the formulae. Satisfiability is thereby reduced to the language emptiness problem for finite automata, which is simply a question of reachability. This reduction show...
متن کاملDecidability of First - Order Logic
We study the problem of deciding satissability of rst order logic queries over views, our aim being to delimit the boundary between the decidable and the undecidable fragments of this language. Views currently occupy a central place in database research, due to their role in applications such as information integration and data warehousing. Our principal result is the identiication of an import...
متن کاملSequent logic of arithmetic decidability∗
Our paper continues, on the one hand, the study of modal logics that have arithmetical semantics, and on the other, the investigation of decidability (or “non-contingency”) logics. We present Hilbert-style axiomatic system for the non-contingency logic of the Gödel-Löb provability logic GL, in other words, for the logic that is complete under the interpretation of a formula BA as ‘a sentence A ...
متن کاملDecidability of Linear AÆne Logic
Propositional linear logic is known to be undecidable. In the current paper we prove that full propositional linear aÆne logic containing all the multiplicatives, additives, exponentials, and constants is decidable. The proof is based on a reduction of linear aÆne logic to sequents of speci c \normal forms", and on a generalization of Kanovich computational interpretation of linear logic adapte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 1996
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1040067318